Telegram Group & Telegram Channel
ART GALLERY PROBLEM
+========+
Time: 1 hour - 2 hours
Difficulty: Hard
Languages: Any
+========+
Given a set of points in two-dimensional space that represent the corners of a polygon, implement a function that finds the smallest number of guards that can be placed at the vertices of the polygon such that every point on the interior of the polygon is visible to at least one guard, using the Chvátal's algorithm
+========+
Please answer to this message with your solution 🙂



tg-me.com/prograchallenges/601
Create:
Last Update:

ART GALLERY PROBLEM
+========+
Time: 1 hour - 2 hours
Difficulty: Hard
Languages: Any
+========+
Given a set of points in two-dimensional space that represent the corners of a polygon, implement a function that finds the smallest number of guards that can be placed at the vertices of the polygon such that every point on the interior of the polygon is visible to at least one guard, using the Chvátal's algorithm
+========+
Please answer to this message with your solution 🙂

BY Programming Challenges


Warning: Undefined variable $i in /var/www/tg-me/post.php on line 283

Share with your friend now:
tg-me.com/prograchallenges/601

View MORE
Open in Telegram


Programming Challenges Telegram | DID YOU KNOW?

Date: |

Why Telegram?

Telegram has no known backdoors and, even though it is come in for criticism for using proprietary encryption methods instead of open-source ones, those have yet to be compromised. While no messaging app can guarantee a 100% impermeable defense against determined attackers, Telegram is vulnerabilities are few and either theoretical or based on spoof files fooling users into actively enabling an attack.

Programming Challenges from ua


Telegram Programming Challenges
FROM USA